Adaptive Mixed-Attribute Data Clustering Method Based on Density Peaks

نویسندگان

چکیده

The clustering of mixed-attribute data is a vital and challenging issue. density peaks algorithm brings us simple efficient solution, but it mainly focuses on numerical attribute cannot be adaptive. In this paper, we studied the adaptive improvement method such an proposed based called AMDPC. algorithm, used unified distance metric to construct matrix, calculated local K-nearest neighbors, automatic determination cluster centers three inflection points. Experimental results real University California-Irvine (UCI) datasets showed that AMDPC could realize data, can automatically obtain correct number clusters, improved accuracy all by more than 22.58%, 24.25%, 28.03%, 22.5%, 10.12% for Heart, Cleveland, Credit, Acute, Adult compared traditional K-prototype respectively. It also outperformed modified (DPC_M) algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptive Method for Clustering by Fast Search-and-Find of Density Peaks: Adaptive-DP

Clustering by fast search and find of density peaks (DP) is a method in which density peaks are used to select the number of cluster centers. The DP has two input parameters: 1) the cutoff distance and 2) cluster centers. Also in DP, different methods are used to measure the density of underlying datasets. To overcome the limitations of DP, an Adaptive-DP method is proposed. In Adaptive-DP meth...

متن کامل

Self-adaptive Trajectory Prediction Method Based on Density Clustering

To solve the problem of user trajectory prediction in the mobile communication environment, we proposed a self-adaptive trajectory prediction method (ATPDC) based on density clustering. And it consists of two stages which are trajectory modeling stage and trajectory updating stage respectively. In the first stage, it constructs the user trajectory prediction model by clustering historical traje...

متن کامل

A Trajectory Data Clustering Method Based On Dynamic Grid Density

Under the traditional method of frequent trajectory mining, the location of data is obtained through the GPS device. However, limited equipment accuracy may incur location ambiguity. In this paper, we propose a new trajectory data clustering method based on dynamic grid density, in order to remove this ambiguity. In this method, the trajectory space of an object is firstly divided into equal-si...

متن کامل

A Link Density Clustering Algorithm based on Automatically Selecting Density Peaks For Overlapping Community Detection

In this paper, we proposed a link density clustering method for overlapping community detection based on density peaks. We firstly use an extended cosine link distance metric to reflect the relationship of links. Then we introduce a clustering algorithm with fast search for solving the link clustering problem by density peaks with box plot strategy to determine the cluster centres automatically...

متن کامل

DFC: Density Fragment Clustering without Peaks

The density peaks clustering (DPC) algorithm is a novel density-based clustering approach. Outliers can be spotted and excluded automatically, and clusters can be found regardless of the shape and of dimensionality of the space in which they are embedded. However, it still has problems when processing a complex data set with irregular shapes and varying densities to get a good clustering result...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Complexity

سال: 2022

ISSN: ['1099-0526', '1076-2787']

DOI: https://doi.org/10.1155/2022/6742120